Description: C++课程设计（职工信息管理系统）
将项目中的代码复制到vc6.0中编译即可-C + + curriculum design (worker information management system)
The project code in the copy to the vc6.0 compiler Platform: |
Size: 2622464 |
Author:小王子Galaxy |
Hits:
Description: 这个文件是编译原理课程设计的实验代码，这段代码中包括了词法分析以及语义树的生成，工程的话用vs2013打开，如果版本低的话，直接把里面的头文件与源文件拷出来在相关的c语言开发环境里建个新的工程就行了，里面有一个例子，直接跑就行了。-This file is experimental code compiler theory of curriculum design, this code is included in the lexical analysis and semantic tree generation, engineering, then use vs2013 open, if the version of the low, then directly to the inside of the header and source files copy them in the relevant c language development environment to build a new project on the line, there is an example, run directly on the line. Platform: |
Size: 1247232 |
Author: |
Hits:
Description: 任务是在词法分析和语法分析程序的基础上编写一个程序，对C 源代码进行语义分析和类型检查，并打印分析结果。与实验一不同的是，实验二不再借助已有的工具，所有的任务都必须手写代码来完成。另外，虽然语义分析在整个编译器的实现中并不是难度最大的任务，但却是最细致、琐碎的任务。因此需要用心地设计诸如符号表、变量类型等数据结构的实现细节，从而正确、高效地实现语义分析的各种功能。
需要注意的是，由于在后面的实验中还会用到本次实验已经写好的代码，因此保持一个良好的代码风格、系统地设计代码结构和各模块之间的接口对于整个实验来讲相当重要。 -Task was to prepare the basis of lexical analysis and syntax analysis program on a program source code for C semantic analysis and type checking, and print the results. The first experiment is different, no longer by means of experiment two existing tools, all tasks must be done hand-written code. In addition, although the semantic analysis is not the most difficult task in the whole compiler implementation, but it is the most detailed, trivial task. Therefore it needs careful design implementation details such as the symbol table, variable types of data structures, which correctly and efficiently implement various functions of semantic analysis.
It should be noted that, due later in the experiment will be used in this experiment has been written code, so keeping the interface between a good coding style, system design and code structure for each module in terms of the whole experiment quite important. Platform: |
Size: 27648 |
Author:沈大川 |
Hits:
Description: 实验5 简单shell的设计和实现（20分）
目的：
1、练习使用编程环境，包括shell的命令，vi和gcc编译器。
2、体会进程概念，了解fork，execve，wait等系统调用。
要求：
1、除了系统调用execve，不允许使用其他的exec函数。输入应当允许带多个参数(一行内可以表示)，不考虑通配符 (即“*”、“?”、“-”等等)的处理。
2、输入错误命令能提示出错并进入下一轮接收命令状态。
3、可以用Ctrl-C和Ctrl-\结束简单shell的运行。
4、程序运行正确，提示简洁明确。
5、实验提交文件为：实验报告、源程序、可执行程序。
-Experiment 5 simple shell design and implementation (20 points)
purpose:
1, practice using the programming environment, including shell commands, vi and gcc compiler.
2, experience the process of concept, understanding fork, execve, wait system calls.
Claim:
1, in addition to the system call execve, are not allowed to use other functions. It should be allowed to enter with more than one parameter (which may represent one line), without considering the wildcard (or * , ? , - Etc.) treatment.
2. Enter the wrong command can prompt an error and the next round receives a command state.
3, you can use Ctrl-C and Ctrl- \ end simple shell operation.
4, the program runs properly, suggesting clear and concise.
5, experiment submissions to: test reports, source code, executable program. Platform: |
Size: 48128 |
Author:苏茗伊 |
Hits:
Description: 问题描述
中缀表达式就是我们通常所书写的数学表达式，后缀表达式也称为逆波兰表达式，在编译程序对我们书写的程序中的表达式进行语法检查时，往往就可以通过逆波兰表达式进行。我们所要设计并实现的程序就是将中缀表示的算术表达式转换成后缀表示，例如，将中缀表达式
(A 一 (B*C 十 D)*E) ／ (F 十 G )
转换为后缀表示为：
ABC*D十E* FG十／
注意：为了简化编程实现，假定变量名均为单个字母，运算符只有＋，－，＊，／ 和＾（指数运算），可以处理圆括号（），并假定输入的算术表达式正确。
要求：使用栈数据结构实现 ，输入的中缀表达式以＃号结束
输入
整数N。表示下面有N个中缀表达式
N个由单个字母和运算符构成的表达式
输出
N个后缀表达式。
-Problem description
Is the infix expression we usually write mathematical expressions, postfix expression also known as anti Poland formula, the compiler checks the syntax of expressions we write in the program, often can be carried out by the anti Poland formula. We need to design and implement a program that will convert infix arithmetic expressions representing suffixes for example, infix expression
(A 1 (B*C ten D) *E () / (F ten G)
Convert to suffix:
ABC*D ten E* FG ten
Note: in order to simplify the programming, assume that the variables are single letters, only the operator +, -, *, / and ^ (exponentiation), can handle the parentheses (), and assume that the input arithmetic expression right.
Requirements: to achieve the use of stack data structure, to the end of the input infix expression directly.
input
Integer N. Express the following N infix expression
N expressions that consist of a single letter and operator
output
N suffix expression. Platform: |
Size: 1024 |
Author:王乐 |
Hits:
Description: 恩智浦官方例程，附有中文说明，适合学习。(This software was adapted to work with a Keil MCB1700 board and
the Keil RV ARM C-Compiler with as few modifications as possible.
Note that modifications are not optimal, because ARM is a 32-bit
machine while the original software was written for 16-bit cpu.
The web page shows the values of two analog inputs (AN0 and AN1).
This tiny webserver needs very little resources and therefore has
some restrictions:
- only one active TCP session at any one time
- no support for fragmented IP datagrams
- no buffer for TCP datagrams received in wrong order
- only one web page. No GIF/JPG graphics possible.
The IP address can be modified in the module tcpip.h to
fit into your existing LAN (see MYIP_x).
Please order the extra issue 'Embedded Internet' of the
'Design & Elektronik' magazine for a technical description.
It is only available in German language.) Platform: |
Size: 1050624 |
Author:大头雕塑
|
Hits:
Search - Compiler Design In c